Logic Functions of Polyphase Complementary Sets
نویسندگان
چکیده
A set consisting of K subsets M sequences length L is called a complementary sequence expressed by A(L, K, M), if the sum out-of-phase aperiodic autocorrelation functions within subset and cross-correlation between corresponding in any two are zero at phase shift. Suehiro et al. first proposed A(Nn, N, N) where N n positive integers greater than or equal to 2. Recently, several sets related Suehiro's construction, such as being power prime number, have been proposed. However, there no discussion about their inclusion relation properties sequences.
منابع مشابه
New Polyphase Complementary Sequence Sets for Wireless Communication Systems
In contemporary wireless communication systems, complementary sequences play fairly important roles. Based on polyphase perfect sequences (PPSs), this paper presents a construction method, whose basic idea is to sample a given PPS with equal space, for yielding a family of periodic polyphase complementary sequence sets (PPCSSs). The advantages of this method include the family size of resultant...
متن کاملClassification of Closed Sets of Functions in Multi-valued Logic
Using Mal’cev’s preiterative algebra (iterative algebra is not sound) we construct in the first time the natural classification of closed sets of functions in multi-valued logic: every closed set belongs only one class and the classes are disjoint. All contemporary papers construct only intersecting classes. We confirm Post’s thesis that multi-valued logic does not contain anything special in c...
متن کاملMinimization of Logic Functions Using Essential Signature Sets
We present a new algorithm for exact two-level logic optimization. It diiers from the classical approach; rather than generating the set of all prime implicants of a function, and then deriving a covering problem, we derive the covering problem directly and implicitly , and then generate only those primes involved in the covering problem. We represent a set of primes by the cube of their inters...
متن کاملFinite Closed Sets of Functions in Multi-valued Logic
The article is devoted to classification of close sets of functions in k-valued logic. We build the classification of finite closed sets. The sets contain only constants and unary functions since sets containing even a two-ary function are infinite. Formulas of the number of finite sets and minimal sets exist for all natural k. We find the numbers of closed sets containing the identity function...
متن کاملAdding partial functions to Constraint Logic Programming with sets
Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}. Although partial functions could be programmed on top of {log}, prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2023
ISSN: ['1745-1337', '0916-8508']
DOI: https://doi.org/10.1587/transfun.2023sdp0003